The Algebra of Directed Acyclic Graphs
نویسندگان
چکیده
We give an algebraic presentation of directed acyclic graph structure, introducing a symmetric monoidal equational theory whose free PROP we characterise as that of finite abstract dags with input/output interfaces. Our development provides an initial-algebra semantics for dag structure.
منابع مشابه
An Initial-Algebra Approach to Directed Acyclic Graphs
The initial-algebra approach to modelling datatypes consists of giving constructors for building larger objects of that type from smaller ones, and laws identifying di erent ways of constructing the same object. The recursive decomposition of objects of the datatype leads directly to a recursive pattern of computation on those objects, which is very helpful for both functional and parallel prog...
متن کاملA Calculus and Algebra for Querying Directed Acyclic Graphs
Resumen. In this paper we present a language for querying directed acyclic graph. The language is based on patterns, that is, grosso modo, on variable-free logic expressions. In order to be included in a broader calculus, the language allows the assignment to variables of portions of a graph that match sub-patterns. Finally, we show how the epressions in the language can be translated into a qu...
متن کاملAlgebraic Structures of Directed Acyclic Graphs: Application to Concurrent Calculus
The paper deenes an algebraic tool for manipulating directed acyclic graphs (on short dags). The approach we propose combines two mathematical tools { category theory and universal algebra { and it allows an unitary treating of dags transformations. We show that the speciication, implementation and programming of concurrent systems can be achieved by using this theory.
متن کاملThe Incidence Hopf Algebra of Graphs
The graph algebra is a commutative, cocommutative, graded, connected incidence Hopf algebra, whose basis elements correspond to finite graphs and whose Hopf product and coproduct admit simple combinatorial descriptions. We give a new formula for the antipode in the graph algebra in terms of acyclic orientations; our formula contains many fewer terms than Takeuchi’s and Schmitt’s more general fo...
متن کاملAlgebras of Quotients of Leavitt Path Algebras
We start this paper by showing that the Leavitt path algebra of a (row-finite) graph is an algebra of quotients of the corresponding path algebra. The path algebra is semiprime if and only if whenever there is a path connecting two vertices, there is another one in the opposite direction. Semiprimeness is studied because, for acyclic graphs, the Leavitt path algebra is a Fountain-Gould algebra ...
متن کامل